
/*
*Pool Public Licence version 0.1 or later
*Released on 20th April 2008.
*Any voilations can be repoted at paritosh@wikiocean.net
*What is treated as voilations can be found at www.wikiocean.net/ppl1-voilations* 
******************************************************************************
* The contents of this file are subject Affero GPL v3 and later with additional conditions.
* The additional conditions are to be considered as part of the Affero GPL v3 and later.
* The additional conditions will supersede the Affero GPLv3 and later in case of conflict.
* ("License"); You may not use this file except in compliance with the License
* You may obtain a copy of the License at http://www.gnu.org/licenses/agpl.html
* Software distributed under the License is distributed on an "AS IS" basis,
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License for
* the specific language governing rights and limitations under the License.
* The Initial Developer of the Original Code is Paritosh Pungaliya.
* created by Paritosh Pungaliya are Copyright (C) Paritosh Pungaliya; All Rights Reserved.
* Contributions are Copyright (C) 2001-2008 Paritosh Pungaliya.

* Objective of the additional terms (license) 
* 1) Is to extend the software freedom to freedom to work.
* 2) To ensure that knowledge is free from monopoly of agencie(s).
* 3) To avoid a situation where big corporates or investors can buy out free software groups and companies and then start milking the communities built around it.
* (this trend can be seen how the openness changes in companies that get Venture Capital funding.)
* (if you agree to this logic I invite you to our group to work together)

* Additional conditions
*  0) Source code will also include
* 	a) data dictionaries, data ontologies which are used to alter the behavior of code or to control           the features of application.
* 	b) Any code generated or derived automatically or manually from this code or logic
*  1) The revenue generated by deploying, implementing , selling services and other activities
*  	 based on this source code should be shared 100%, between the people working on it.
*  2) Capital invested should be given only fixed rate of return or linked to revenue/surplus growth for limited time.
*  3) People working on the project should always have an option to replace the capital provider in full or part with lower cost capital.
*  4) Their should not be any ownership which can be sold as a claim on future profit to be generated from the work of people working on the code.
*  5) Brand thus generated should belong to the group.
*  6) For old and new members revenue sharing should be equal for same work equivalent.
*  7) The share of revenue should be decided by bidding for work before allocation of work within the group.
*  8) Before bidding various method of measuring the work should be clearly defined and published in public domain. Any change in process should also be publised in public domain imediately.
*  9) All data related to to revenue sharing should be published as and when generated in public domain.
*  10) For group of people having size more than 10 people will have to make it open online for others to participate in bids. 
*  11) All people involved in related and sub project will be treated as a group.
*  12) Once this license is being used for a certain code then all and any other software services being provided by the group should complusorilly come under 100% revenue sharing.
*  13) Cross subsidization should not happen under this revenue share, no additional benefit should be drawn from the people, by the employing agency.
*  14) Any position or knowledge or legal structure created relating to people working on code, which adversely affects the spirit of 100% revenue share will be treated as a violation.
*  15) Revenue sharing defined.
*     a) includes direct revenue and also intangible gains like brand, and organization.
*     b) No personal judgment should be involved in judging the distribution of revenue.It has to be pre-defined formula based.
*     c)100% of revenue should be shared before expenses and recievers should have control over what expenses to incur.
*     d)For the work done in any month by contributing group member, working on any project can be given revenue share from the work done by the group, for a maximum of 18 months after that month.
*     e)Revenue should be apportioned to the month in which work is done and not when received.
*  The group fulfilling the above conditions also has to be a wiki ecosystem further defined in www.wekosystem.org or read about Wekosystem at www.wikiocean.net

*  ******************************************************************************
*/  
package sort;

import timer.ExecutionTimer;
import timer.TimerRecordFile;
import validation.Isnumeric;


public class BufferSorting 
{
					 
	String split[],strValue[];
	private int index;
	int intValue[];
	
	
	public String[] bufferSorting(String buffer[],String str)
	{
		ExecutionTimer t = new ExecutionTimer();
		t.start();
		String[] splitStr=buffer[0].split("\t");
		split=new String[splitStr.length];
		strValue=new String[buffer.length-1];
		//Isnumeric isn=new Isnumeric();
		intValue = new int[buffer.length-1];
		split=buffer[0].split("\t");
		for(int i=0;i<split.length;i++)
		{			
			if(split[i].toLowerCase().equals(str.toLowerCase()))
			{
				index=i;
				//System.out.println("index1 is "+index1);
			}
		}
		
		for(int i=1;i<buffer.length;i++)
		{
			split=buffer[i].split("\t");		
			strValue[i-1]=split[index];
			//System.out.println(strValue[i-1]);
		}
		//for(int i =0;i<split.length;i++)
		//	System.out.println(strValue[i]);
		for(int i=0;i<buffer.length-1;i++)
		{
			//if(isn.validate(strValue[i])==true)
			{
			//intValue[i]=Integer.parseInt(strValue[i]);
		 	//System.out.print(intValue[i]+" ");
			}
			//else
			{
				strValue[i]=strValue[i];
				//System.out.println(strValue[i]);
			}
			
		}
	

		

		if(intValue[0]!=0)
		{
			sortIds(intValue);
			String intStr[]=new String[intValue.length];
			for (int j = 0; j < buffer.length-1; j++)
			{
				Integer i=new Integer(intValue[j]);
					intStr[j]=i.toString();
				//System.out.print(intValue[j] + " ");
			}
			t.end();
			TimerRecordFile timerFile=new TimerRecordFile("sort","BufferSorting","bufferSorting",t.duration());
			return intStr;			
		}
		
		else
		{
			sortStrings(strValue,strValue.length);
			t.end();
			TimerRecordFile timerFile=new TimerRecordFile("sort","BufferSorting","bufferSorting",t.duration());
			return strValue;
			//for(int x = 0; x < buffer.length-1; ++x)
			//	System.out.print(strValue[x]+" ");	
		}	 
	
	
}


	void sortIds(int a[])
	{
		ExecutionTimer t = new ExecutionTimer();
		t.start();
		for (int i = a.length; --i>=0; )
		{		           
		    for (int j = 0; j<i; j++)
		    {
		    	if (a[j] > a[j+1]) 
		    	{
		    		int T = a[j];
		    		a[j] = a[j+1];
		    		a[j+1] = T;
			   }
		    }			
		}   
		//for(int x = 0; x < a.length; ++x)
					//System.out.print(a[x]+" ");
		t.end();
		TimerRecordFile timerFile=new TimerRecordFile("sort","BufferSorting","sortIds",t.duration());
	}

	 void sortStrings(String[] array, int len)
	{		
	ExecutionTimer t = new ExecutionTimer();
	t.start();
	int a, b;
	String temp;
	int highSubscript = len - 1;
	for(a = 0; a < highSubscript; ++a)
		for(b = 0; b < highSubscript; ++b)
			if(array[b].toLowerCase().compareTo(array[b + 1].toLowerCase()) > 0)
			{
				temp = array[b];
				array[b] = array[b + 1];
				array[b + 1] = temp;
			}	
	t.end();
	TimerRecordFile timerFile=new TimerRecordFile("sort","BufferSorting","sortStrings",t.duration());
	}		
		
		
	
	
	public static void main(String args[])
	{			
		ExecutionTimer t = new ExecutionTimer();
		t.start();
		String buffer[]=new String[]{"id\tName\tAddr\tDesig\tPhone\tCas",
									 "1\tshweta\tpune\tsw\t111201\tH",
									 "2\tmegha\tbanglore\thr\t101301\tH",
									 "3\tReena\tDelhi\thw\t101\tH",
									 "4\theena\tpatna\tst\t1123\tG",
									 "5\tvrinda\tkolkata\tst\t10\tG",
									 "6\tkomal\traipur\thw\t11223\tH"
				 					};
			String str="phone";
		
			BufferSorting bfs=new BufferSorting();
			buffer=bfs.bufferSorting(buffer,str);
			for(int x = 0; x < buffer.length; ++x)
					System.out.print(buffer[x]+" ");	
			t.end();
			TimerRecordFile timerFile=new TimerRecordFile("sort","BufferSorting","main",t.duration());
			
	}
}
